Encoding Left Reduction in the Lambda-Calculus with Interaction Nets
نویسنده
چکیده
منابع مشابه
Token-passing Optimal Reduction with Embedded Read-back
We introduce a new interaction net implementation of optimal reduction for the pure untyped lambda calculus. Unlike others, our implementation allows to reach normal form regardless of the interaction net reduction strategy using the approach of so-called token-passing nets and a non-deterministic extension for interaction nets. Another new feature is the read-back mechanism implemented without...
متن کاملMacro Lambda Calculus
The goal of our Macro Lambda Calculus project (MLC) is to encode λ-terms into interaction nets. Its software implementation accepts input in the notation similar to λ-calculus allowing macro definitions. Output is similar to interaction calculus and is suitable for our Interaction Nets Compiler program (INC). In this paper, we describe the interaction system for call-by-need evaluation and the ...
متن کاملFrom Functional Programs to Interaction Nets via the Rewriting Calculus
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising from the compilation. This encoding gives rise to new strategies of evaluation, where pattern-matching and ‘traditional’ β-reduction can proceed in parallel without overheads.
متن کاملA token-passing net implementation of optimal reduction with embedded read-back
In this paper, we introduce a new interaction net implementation of optimal reduction for pure untyped lambda calculus. Unlike others, our implementation allows to reach normal form regardless of interaction net reduction strategy using the approach of so-called token-passing nets. Another new feature is the read-back mechanism also implemented without leaving the formalism of interaction nets.
متن کاملIntuitionistic differential nets and lambda-calculus
We define pure intuitionistic differential proof nets, extending Ehrhard and Regnier’s differential interaction nets with the exponential box of Linear Logic. Normalization of the exponential reduction and confluence of the full one is proved. These results are directed and adjusted to give a translation of Boudol’s untyped λ-calculus with resources extended with a linear-non linear reduction à...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 12 شماره
صفحات -
تاریخ انتشار 2002